Modular classes of skew algebroid relations
نویسندگان
چکیده
منابع مشابه
Characteristic Classes of Lie Algebroid Morphisms
We extend R. Fernandes’ construction of the secondary characteristic classes of a Lie algebroid to the case of a base-preserving morphism between two Lie algebroids. Like in the case of a Lie algebroid, the simplest characteristic class of our construction coincides with the modular class of the morphism. In [4] R. Fernandes has constructed a sequence of secondary characteristic classes of a Li...
متن کاملDifferentiable and algebroid cohomology , van Est isomorphisms , and characteristic classes ∗
In the first section we discuss Morita invariance of differentiable/algebroid cohomology. In the second section we extend the Van Est isomorphism to groupoids. As a first application we clarify the connection between differentiable and algebroid cohomology (proved in degree 1, and conjectured in degree 2 by Weinstein-Xu [50]). As a second application we extend Van Est’s argument for the integra...
متن کاملModular Classes of Loday Algebroids
We introduce the concept of Loday algebroids, a generalization of Courant algebroids. We define the naive cohomology and modular class of a Loday algebroid, and we show that the modular class of the double of a Lie bialgebroid vanishes. For Courant algebroids, we describe the relation between the naive and standard cohomologies and we conjecture that they are isomorphic when the Courant algebro...
متن کاملEmbedding in Switching Classes with Skew Gains
In the context of graph transformation we look at the operation of switching, which can be viewed as an elegant method for realizing global transformations of (group-labelled) graphs through local transformations of the vertices. Various relatively efficient algorithms exist for deciding whether a graph can be switched so that it contains some other graph, the query graph, as an induced subgrap...
متن کاملSkew Chromatic Index of Certain Classes of Graphs
A skew edge coloring of a graph G is defined to be a set of two edge colorings such that no two edges are assigned the same unordered pair of colors. The skew chromatic index s(G) is the minimum number of colors required for a skew edge coloring of G. In this paper, skew edge coloring of certain classes of graphs are determined. Furthermore, the skew chromatic index of those graphs is obtained ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transformation Groups
سال: 2012
ISSN: 1083-4362,1531-586X
DOI: 10.1007/s00031-012-9197-2